Uniform Random Voronoi Meshes
نویسندگان
چکیده
We generate Voronoi meshes over three dimensional domains with prescribed boundaries. Voronoi cells are clipped at one-sided domain boundaries. The seeds of Voronoi cells are generated by maximal Poisson-disk sampling. In contrast to centroidal Voronoi tessellations, our seed locations are unbiased. The exception is some bias near concave features of the boundary to ensure well-shaped cells. The method is extensible to generating Voronoi cells that agree on both sides of two-sided internal boundaries. Maximal uniform sampling leads naturally to bounds on the aspect ratio and dihedral angles of the cells. Small cell edges are removed by collapsing them; some facets become slightly non-planar. Voronoi meshes are preferred to tetrahedral or hexahedral meshes for some Lagrangian fracture simulations. We may generate an ensemble of random Voronoi meshes. Point location variability models some of the material strength variability observed in physical experiments. The ensemble of simulation results defines a spectrum of possible experimental results.
منابع مشابه
Voronoi - based finite volume methods , optimal Voronoi meshes , and PDEs on the sphere q
We first develop and analyze a finite volume scheme for the discretization of partial differential equations (PDEs) on the sphere; the scheme uses Voronoi tessellations of the sphere. For a model convection–diffusion problem, the finite volume scheme is shown to produce first-order accurate approximations with respect to a mesh-dependent discrete firstderivative norm. Then, we introduce the not...
متن کاملApproximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct uniform tessellations, and therefore leads to uniform coarsening of polygonal meshes, when the output triangulation has many fewer elements than the input mesh. The mesh topology is also simplified by the clustering algo...
متن کامل3D Mesh Coarsening via Uniform Clustering
In this paper, we present a fast and efficient mesh coarsening algorithm for 3D triangular meshes. Theis approach can be applied to very complex 3D meshes of arbitrary topology and with millions of vertices. The algorithm is based on the clustering of the input mesh elements, which divides the faces of an input mesh into a given number of clusters for clustering purpose by approximating the Cen...
متن کاملA Multiscale Nonhydrostatic Atmospheric Model Using Centroidal Voronoi Tesselations and C-Grid Staggering
The formulation of a fully compressible nonhydrostatic atmospheric model called the Model for Prediction Across Scales–Atmosphere (MPAS-A) is described. The solver is discretized using centroidal Voronoi meshes and a C-grid staggering of the prognostic variables, and it incorporates a split-explicit time-integration technique used in many existing nonhydrostatic mesoand cloud-scale models. MPAS...
متن کاملFinite Volume Methods on Spheres and Spherical Centroidal Voronoi Meshes
Abstract. We study in this paper a finite volume approximation of linear convection diffusion equations defined on a sphere using the spherical Voronoi meshes, in particular, the spherical centroidal Voronoi meshes. The high quality of spherical centroidal Voronoi meshes is illustrated through both theoretical analysis and computational experiments. In particular, we show that the error of the ...
متن کامل